Improved Lower Bounds for Online Hypercube Packing
نویسندگان
چکیده
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing hypercubes into bins in two or more dimensions, once for general algorithms (in two dimensions) and once for an important subclass, so-called Harmonic-type algorithms (in two or more dimensions). Lastly, we show that two adaptions of the ideas from the best known one-dimensional packing algorithm [9] to square packing also do not help to break the barrier of 2.
منابع مشابه
Bounds for online bounded space hypercube packing
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2,...,7. 200...
متن کاملImproved Online Hypercube Packing
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing problem and obtain new upper bounds of asymptotic competitive ratios. For square packing, we get an upper bound of 2.1439, which is better than 2.24437. For c...
متن کاملA tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
We prove a tight lower bound on the asymptotic performance ratio ρ of the bounded space online d-hypercube bin packing problem, solving an open question raised in 2005. In the classic d-hypercube bin packing problem, we are given a sequence of d-dimensional hypercubes and we have an unlimited number of bins, each of which is a d-dimensional unit hypercube. The goal is to pack (orthogonally) the...
متن کاملLower bounds for several online variants of bin packing
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.
متن کاملImproved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints
The bin packing problem has been extensively studied and numerous variants have been considered. The k-item bin packing problem is one of the variants introduced by Krause et al. in Journal of the ACM 22(4). In addition to the formulation of the classical bin packing problem, this problem imposes a cardinality constraint that the number of items packed into each bin must be at most k. For the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1607.01229 شماره
صفحات -
تاریخ انتشار 2016